Efficient homophonic coding

Employment of Homophonic Coding for Improvement of Certain Encryption Approaches Based on the LPN Problem

This paper proposes an improvement of certain encryption approaches designed based on hardness of the learning from parity with noise (LPN) problem. The proposal employs a dedicated homophonic coding and randomness resulting in a harder underlying LPN problem in comparison with the related source schemes without homophonic coding. It is shown that the proposed scheme provides the following secu...

Homophonic Coding Design for Communication Systems Employing the Encoding-Encryption Paradigm

This paper addresses the design of a dedicated homophonic coding for a class of communication systems which, in order to provide both reliability and security, first encode the data before encrypting it, which is referred to as the encoding-encryption paradigm. The considered systems employ errorcorrection coding for reliability, a stream cipher for encryption, and homophonic coding to enhance ...

Efficient Attacks on Homophonic Substitution Ciphers

Efficient Attacks On Homophonic Substitution Ciphers by Amrapali Dhavare Substitution ciphers are one of the earliest types of ciphers. Examples of classic substitution ciphers include the well-known simple substitution and the less well-known homophonic substitution. Although simple substitution ciphers are indeed simple both in terms of their use and attacks; the homophonic substitution ciphe...

Efficient Cryptanalysis of Homophonic Substitution Ciphers

Substitution ciphers are among the earliest methods of encryption. Examples of classic substitution ciphers include the well-known simple substitution and the less well-known homophonic substitution. Simple substitution ciphers are indeed simple, both in terms of their use and their cryptanalysis. Homophonic substitutions—in which a plaintext symbol can map to more than one ciphertext symbol—ar...

A Universal Algorithm for Homophonic Coding